Admissibilities of Agglomerative Hierarchical Clustering Algorithms with Respect to Space Distortion and Monotonicity

نویسندگان

  • Akinobu Takeuchi
  • Hiroshi Yadohisa
  • Koichi Inada
چکیده

The concept of admissibility with respect to clustering algorithms was introduced by Fisher and Van Ness (1971). They defined types of admissibility of an algorithm and indicated the relationships between these admissibilities and popular clustering algorithms. In recent years, admissibility with respect to space distortion (See, Lance and Williams, 1967) has been proposed by Chen and Van Ness (1994 and 1996). Mirkin (1996) proposed the admissibility for monotonicity of an updating formula. In this paper, we propose new admissibilities with respect to space distortion and monotonicity, which are defined by Yadohisa, Takeuchi and Inada (1999) and Mirkin (1996), respectively. We also provide the necessary and sufficient conditions for Lance and Williams’ updating formula for the proposed admissibilities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Space Distortion and Monotone Admissibility in Agglomerative Clustering

This paper discusses the admissibility of agglomerative hierarchical clustering algorithms with respect to space distortion and monotonicity, as defined by Yadohisa et al. and Batagelj, respectively. Several admissibilities and their properties are given for selecting a clustering algorithm. Necessary and sufficient conditions for an updating formula, as introduced by Lance and Williams, are pr...

متن کامل

Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results

We explore the use of instance and cluster-level constraints with agglomerative hierarchical clustering. Though previous work has illustrated the benefits of using constraints for non-hierarchical clustering, their application to hierarchical clustering is not straight-forward for two primary reasons. First, some constraint combinations make the feasibility problem (Does there exist a single fe...

متن کامل

A Study on the Hierarchical Data Clustering Algorithm Based on Gravity Theory

This paper discusses the clustering quality and complexities of the hierarchical data clustering algorithm based on gravity theory. The gravitybased clustering algorithm simulates how the given N nodes in a K-dimensional continuous vector space will cluster due to the gravity force, provided that each node is associated with a mass. One of the main issues studied in this paper is how the order ...

متن کامل

Applying agglomerative hierarchical clustering algorithms to component identification for legacy systems

Context: Component identification, the process of evolving legacy system into finely organized component-based software systems, is a critical part of software reengineering. Currently, many component identification approaches have been developed based on agglomerative hierarchical clustering algorithms. However, there is a lack of thorough investigation on which algorithm is appropriate for co...

متن کامل

A Relative Approach to Hierarchical Clustering

This paper presents a new approach to agglomerative hierarchical clustering. Classical hierarchical clustering algorithms are based on metrics which only consider the absolute distance between two clusters, merging the pair of clusters with highest absolute similarity. We propose a relative dissimilarity measure, which considers not only the distance between a pair of clusters, but also how dis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999